Erratum to: On Definability in Dependence Logic

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Erratum to: On Definability in Dependence Logic

A correction is needed for the singular case X = ∅ in Theorems 4.9, 4.10, 5.1, and 5.2. In Kontinen and Väänänen (2009), the open formulas of Dependence Logic (D) were studied. Formulas of dependence logic express properties of sets of assignments (teams). It was shown in Väänänen (2007) that every formula of dependence logic can be represented in an equivalent form in existential second-order ...

متن کامل

On Definability in Dependence Logic

We study the expressive power of open formulas of dependence logic introduced in Väänänen [Dependence logic (Vol. 70 of London Mathematical Society Student Texts), 2007]. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable bymeans of identity only in dependence logic, or equivalently in independence friendly logic.

متن کامل

Uniform Definability in Propositional Dependence Logic

Both propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula in the language of inquisitive logic with intuitionistic disjunction or intuitionistic implication can be translated equivalently into a formula in the language of propositional dependence logic without these two connectives. We show that although such a (noncompositional) transl...

متن کامل

Two Forms of Dependence in Propositional Logic: Controllability and Definability

We investigate two forms of dependence between variables and/or formulas within a propositional knowledge base: controllability (a set of variables X controls a formula if there is a way to fix the truth value of the variables in X in order to achieve to have a prescribed truth value) and definability (X defines a variable y if every truth assignment of the variables inX enables us finding out ...

متن کامل

On Definability in Multimodal Logic

Three notions of definability in multimodal logic are considered. Two are analogous to the notions of explicit definability and implicit definability introduced by Beth in the context of first-order logic. However, while by Beth’s theorem the two types of definability are equivalent for first-order logic, such an equivalence does not hold for multimodal logics. A third notion of definability, r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Logic, Language and Information

سال: 2010

ISSN: 0925-8531,1572-9583

DOI: 10.1007/s10849-010-9125-6